Graph domination, tabu search and the football pool problem
نویسندگان
چکیده
منابع مشابه
Graph Domination, Tabu Search and the Football Pool Problem
We describe the use of a tabu search algorithm for generating near minimum dominating sets in graphs. We demonstrate the eeectiveness of this algorithm by considering a previously studied class of graphs, the so-called \football pool" graphs, and improving many of the known upper bounds for this class.
متن کاملThe Inverse Football Pool Problem
The minimal number of spheres (without “interior”) of radius n required to cover the finite set {0, . . . , q−1} equipped with the Hamming distance is denoted by T (n, q). The only hitherto known values of T (n, q) are T (n, 3) for n = 1, . . . , 6. These were all given in the 1950s in the Finnish football pool magazine Veikkaaja along with upper and lower bounds for T (n, 3) for n ≥ 7. Recentl...
متن کاملPosition-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. While there are many wellstudied methods to help the search process escape a basin of attraction, it seems more difficult to prevent it from looping between a limited number of basins of attraction. We introduce a Positi...
متن کاملTabu Search for the Graph Coloring Problem (extended)
Given an undirected graph G = (V, E), the Graph Coloring Problem (GCP) requires to assign a color to each vertex in such a way that colors on adjacent vertices are different and the number of colors used is minimized. A subset of V is called a stable set if no two adjacent vertices belong to it. A k coloring of G is a coloring which uses k colors, and corresponds to a partition of V into k stab...
متن کاملGraph Partitioning Using Tabu Search
In this paper, we present another approach to the balanced minimum cut graph partitioning problem. This approach is based on the meta-heuristic known as tabu search. Our experimental results compare favorably with two of the most effecitive methods available in terms of quality of solutions and computational times. Our experience and experiments suggest that this technique can be applied effect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1997
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00049-2